FPGA-Based Hardware Design for Scale-Invariant Feature Transform
نویسندگان
چکیده
منابع مشابه
Classification of Satellite Images based on Scale-Invariant Feature Transform
From the immense amount of images being sent to Earth by satellites, it takes too much time for a human to go through each image and classify what the image represents. Therefore, we are able to use classifiers to classify these images. In this paper, we used two different classification methods to classify satellite images. Between the two classifiers we used, both K-Nearest-Neighbor and Suppo...
متن کامل-SIFT: -Dimensional Scale Invariant Feature Transform
We propose the -dimensional scale invariant feature transform ( -SIFT) method for extracting and matching salient features from scalar images of arbitrary dimensionality, and compare this method’s performance to other related features. The proposed features extend the concepts used for 2-D scalar images in the computer vision SIFT technique for extracting and matching distinctive scale invarian...
متن کاملFast Implementation of Scale Invariant Feature Transform Based on CUDA
Scale-invariant feature transform (SIFT) was an algorithm in computer vision to detect and describe local features in images. Due to its excellent performance, SIFT was widely used in many applications, but the implementation of SIFT was complicated and time-consuming. To solve this problem, this paper presented a novel acceleration algorithm for SIFT implementation based on Compute Unified Dev...
متن کاملDigital Image Stabilization Based on Improved Scale Invariant Feature Transform
A novel digital image stabilization approach using Harris and Scale Invariant Feature Transform (SIFT) was presented in this article. Using SIFT in digital image stabilization, too many feature points and matches were extracted, but some of them were not so stable. Using these feature points and matches can not only increase the computational effort, but also enhance the wrong matching probabil...
متن کاملPerformance Evaluation of Scale Invariant Feature Transform
The SIFT algorithm produces keypoint descriptors. This paper analyzes that the SIFT algorithm generates the number of keypoints when we increase a parameter (number of sublevels per octave). SIFT has a good hit rate for this analysis. The algorithm was tested over a specific data set, and the experiments were conducted to increase the performance of SIFT in terms of accuracy and efficiency so a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2018
ISSN: 2169-3536
DOI: 10.1109/access.2018.2863019